Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
نویسندگان
چکیده
We prove an exponential lower bound on the size of static LovászSchrijver proofs of Tseitin tautologies. We use several techniques, namely, translating static LS+ proof into Positivstellensatz proof of Grigoriev et al., extracting a “good” expander out of a given graph by removing edges and vertices of Alekhnovich et al., and proving linear lower bound on the degree of Positivstellensatz proofs for Tseitin tautologies.
منابع مشابه
Complexity of Semi-algebraic Proofs
It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász– Schrijver calculi (LS) utilizing quadratic inequalities. We introduce generalizations LS of LS that operate on polynomial ine...
متن کاملExponential Lower Bound for Static Semi-algebraic Proofs
Semi-algebraic proof systems were introduced in [1] as extensions of Lovász-Schrijver proof systems [2,3]. These systems are very strong; in particular, they have short proofs of Tseitin’s tautologies, the pigeonhole principle, the symmetric knapsack problem and the cliquecoloring tautologies [1]. In this paper we study static versions of these systems. We prove an exponential lower bound on th...
متن کاملComplexity of Semialgebraic Proofs with Restricted Degree of Falsity
A weakened version of the Cutting Plane (CP) proof system with a restriction on the degree of falsity of intermediate inequalities was introduced by Goerdt. He proved an exponential lower bound for CP proofs with degree of falsity bounded by n log2 n+1 , where n is the number of variables. Hirsch and Nikolenko strengthened this result by establishing a direct connection between CP and Resolutio...
متن کاملExponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one programs by the addition of new linear inequalities. We address the question of how many new inequalities are necessary to approximate certain combinatorial problems with strong guarantees, and to solve certain instances of Boolean satisfiability. We show that relaxations of linear programs, obtain...
متن کاملRank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua
We present a new method for proving rank lower bounds for Cutting Planes (CP) and several procedures based on lifting due to Lovász and Schrijver (LS), when viewed as proof systems for unsatisfiability. We apply this method to obtain the following new results: First, we prove near-optimal rank bounds for Cutting Planes and LovászSchrijver proofs for several prominent unsatisfiable CNF examples,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006